منابع مشابه
On the Least Cost for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database those elements that are similar to a query. As the distance is usually expensive to compute, the goal is to use as few distance computations as possible to satisfy queries. Indexes use precomputed distances among database elements to speed up queries. As such, a baseline is AESA, which stores all the distances among database objects, bu...
متن کاملLeast-Cost Planning Sequence Estimation in Labeled Petri Nets
This paper develops a recursive algorithm for estimating the least-cost planning sequence in a manufacturing system that is modeled by a labeled Petri net. We consider a setting where we are given a sequence of labels that represents a sequence of tasks that need to be executed during a manufacturing process, and we assume that each label (task) can potentially be accomplished by a number of di...
متن کاملLeast-cost planning sequence estimation in labelled Petri nets
estimation in labelled Petri nets Lingxi Li and Christoforos N. Hadjicostis Department of Electrical and Computer Engineering, Indiana University-Purdue University Indianapolis, Indianapolis, IN, USA Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus Coordinated Science Laboratory and the Department of Electrical and Computer Engineering, University of Illi...
متن کاملLeast-Cost Opportunistic Routing
In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the packet further. If no candidate receives the packet, then the current sender re-transmits. If multiple candidates receive the packet, then the l...
متن کاملOn minimum cost edge searching
We consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: College & Research Libraries
سال: 1964
ISSN: 2150-6701,0010-0870
DOI: 10.5860/crl_25_02_126